Practical Play of the Dice Game Pig
نویسندگان
چکیده
The object of the jeopardy dice game Pig is to be the first player to reach 100 points. Each turn, a player repeatedly rolls a die until either a 1 is rolled or the player holds and scores the sum of the rolls (i.e., the turn total). At any time during a player’s turn, the player is faced with two choices: roll or hold. If the player rolls a 1, the player scores nothing and it becomes the opponent’s turn. If the player rolls a number other than 1, the number is added to the player’s turn total and the player’s turn continues. If the player instead chooses to hold, the turn total is added to the player’s score and it becomes the opponent’s turn. In our original article [Neller and Presser 2004], we described a means to compute optimal play for Pig. However, optimal play is surprisingly complex and beyond human potential to memorize and apply. In this paper, we mathematically explore a more subjective question:
منابع مشابه
MATHEMATICAL MODELLING FOR DICE FINDER GAME PROBLEM
Play is often episodic and mission-centric, with a series of challenges culminating in a final puzzle or enemy that must be overcome. Multiple missions played with the same characters may be related to each other in a plot arc of escalating challenges. The exact tone, structure, pace and end (if any) vary from game to game depending on the needs and preferences of the players, as in [9]. "THE C...
متن کاملOptimal Play of the Dice Game Pig
The object of the jeopardy dice game Pig is to be the first player to reach 100 points. Each player's turn consists of repeatedly rolling a die. After each roll, the player is faced with two choices: roll again, or hold (decline to roll again). • If the player rolls a 1, the player scores nothing and it becomes the opponent's turn. • If the player rolls a number other than 1, the number is adde...
متن کاملDynamic decision making and race games
Frequent criticism in dynamic decision making research pertains to the overly complex nature of the decision tasks used in experimentation. To address such concerns we study dynamic decision making with respect to the simple race game Hog, which has a computable optimal decision strategy. In the two-player game of Hog, individuals compete to be the first to reach a designated threshold of point...
متن کاملSolving the Dice Game Pig: an introduction to dynamic programming and value iteration
For such a simple dice game, one might expect a simple optimal strategy, such as in Blackjack (e.g., “stand on 17” under certain circumstances, etc.). As we shall see, this simple dice game yields a much more complex and intriguing optimal policy. In our exploration of Pig we will learn about dynamic programming and value iteration, covering fundamental concepts of reinforcement learning techni...
متن کاملEndgame Strategies and Simulation Results for the Liar’s Dice Game
The Liar’s dice is a dice game where deception and the ability to detect the opponents’ deception play a crucial role. We analyze this game from different perspectives. First, two-player endgames are analyzed and optimal strategies are calculated. Second, using simulation methods, we examine heuristic playing strategies based on their success against each other. In the simulations, we consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010